Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve ...
متن کاملHybrid Taguchi-based Genetic Algorithm for Flowshop Scheduling Problem
A hybrid Taguchi-based genetic algorithm (HTGA) is developed for solving multi-objective flowshop scheduling problems (FSPs). Search performance is improved by using Taguchi-based crossover to avoid scheduling conflicts, and dynamic weights are randomly selected by a fuzzy inference system. The conventional approach to selecting dynamic weights randomly ignores small value for the objective whe...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملA hybrid genetic algorithm for solving no-wait flowshop scheduling problems
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are represe...
متن کاملHybrid Flowshop Scheduling Using Discrete Harmony Search And Genetic Algorithm
In this paper a hybrid genetic and harmony search algorithm is proposed to find the possible best sequence of operation solutions for hybrid flow shop scheduling problems. In this work the problem is considered with respect to the objective of minimization of makespan. Hybrid flow shop scheduling problem is considered for the sequencing of jobs in a hybrid flow shop with two or more identical m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2020
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2019.10.004